A parallel algorithm for solving general tridiagonal equations
نویسندگان
چکیده
منابع مشابه
A Parallel Algorithm for Solving General Tridiagonal Equations
A parallel algorithm for the solution of the general tridiagonal system is presented. The method is based on an efficient implementation of Cramer's rule, in which the only divisions are by the determinant of the matrix. Therefore, the algorithm is defined without pivoting for any nonsingular system. 0(n) storage is required for n equations and (?(log n) operations are required on a parallel co...
متن کاملParallel dichotomy algorithm for solving tridiagonal SLAEs
A parallel algorithm for solving a series of matrix equations with a constant tridiagonal matrix and different right-hand sides is proposed and studied. The process of solving the problem is represented in two steps. The first preliminary step is fixing some rows of the inverse matrix of SLAEs. The second step consists in calculating solutions for all right-hand sides. For reducing the communic...
متن کاملAn hybrid parallel algorithm for solving tridiagonal linear systems
In this paper we describe an hybrid algorithm for an even number of processors based on an algorithm for two processors and the Overlapping Partition Method for tridiagonal systems. Moreover, we compare this hybrid method with the Partition Wang’s method in a BSP computer. Finally, we compare the theoretical computation cost of both methods for a Cray T3D computer, using the cost model that BSP...
متن کاملAlgorithm for Solving Tridiagonal Matrix Problems in Parallel
A new algorithm is presented, designed to solve tridiagonal matrix problems efficientiy with parallel computers (multiple instruction stream, multiple data stream (MIMD) machines with distributed memory). The algorithm is designed to be extendable to higher order banded diagonal systems.
متن کاملAn hybrid parallel algorithm for solving tridiagonal linear systems
In this paper we describe an hybrid algorithm for an even number of processors based on an algorithm for two processors and the Overlapping Partition Method for tridiagonal systems. Moreover, we compare this hybrid method with the Partition Wang’s method in a BSP computer. Finally, we compare the theoretical computation cost of both methods for a Cray T3D computer, using the cost model that BSP...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1979
ISSN: 0025-5718,1088-6842
DOI: 10.1090/s0025-5718-1979-0514818-5